Structural Sensitivity of Neural and Genetic Networks

International audienceThis paper aims at giving new results on the structural sensitivity of biological networks represented by threshold Boolean networks and ruled by Hopfield-like evolution laws classically used in the context of neural and genetic networks. Indeed, the objective is to present how certain changes and/or perturbations in such networks can modify signicantly their asymptotic behaviour. More precisely, this work has been focused on three diferent kinds of what we think to be relevant in the biological area of robustness (in both theoretical and applied frameworks): the boundary sensitivity (external fields, hormone flows, ...), the state sensitivity (axonal or somatic modulations, microRNAs actions, ...) and the updating sensitivity

Non-maximal sensitivity to synchronism in periodic elementary cellular automata: exact asymptotic measures

In [11] and [13] the authors showed that elementary cellular automata rules 0, 3, 8, 12, 15, 28, 32, 34, 44, 51, 60, 128, 136, 140, 160, 162, 170, 200 and 204 (and their conjugation, reflection, reflected-conjugation) are not maximum sensitive to synchronism, i.e. they do not have a different dynamics for each (non-equivalent) block-sequential update schedule (defined as ordered partitions of cell positions). In this work we present exact measurements of the sensitivity to synchronism for these rules, as functions of the size. These exhibit a surprising variety of values and associated proof methods, such as the special pairs of rule 128, and the connection to the bissection of Lucas numbers of rule 8

On the complexity of acyclic modules in automata networks

Modules were introduced as an extension of Boolean automata networks. They have inputs which are used in the computation said modules perform, and can be used to wire modules with each other. In the present paper we extend this new formalism and study the specific case of acyclic modules. These modules prove to be well described in their limit behavior by functions called output functions. We provide other results that offer an upper bound on the number of attractors in an acyclic module when wired recursively into an automata network, alongside a diversity of complexity results around the difficulty of deciding the existence of cycles depending on the number of inputs and the size of said cycle.Comment: 21 page

Decision analysis applied to the fishery of the sea snail Concholepas concholepas from central northern coast of Chile

Formal decision analysis was applied to the management of loco (Concholepas concholepas, Fam. Muricidae) in Chile, 29-35 degrees S. Four interested groups were considered "Fishers", "Scientists", "Buyers" and the "State", along with three fishing effort levels and four subobjectives. The method was found to encourage the emergence of a consensus (here: halving of effort), and is recommended for use in other fisheries

A guided tour of asynchronous cellular automata

Research on asynchronous cellular automata has received a great amount of attention these last years and has turned to a thriving field. We survey the recent research that has been carried out on this topic and present a wide state of the art where computing and modelling issues are both represented.Comment: To appear in the Journal of Cellular Automat

Implementation and Performance of the ATLAS Second Level Jet Trigger

ATLAS is one of the four major LHC experiments, designed to cover a wide range of physics topics. In order to cope with a rate of 40 MHz and 25 interactions per bunch crossing, the ATLAS trigger system is divided in three different levels. The first one (LVL1, hardware based) identifies signatures in 2 microseconds that are confirmed by the the following trigger levels (software based). The Second Level Trigger (LVL2) only looks at a region of the space around the LVL1 signature (called Region of Interest or ROI), confirming/rejecting the event in about 10 ms, while the Event Filter (Third Level Trigger, EF) has potential full event access and larger processing times, of the order of 1 s. The jet selection starts at the LVL1 with dedicated processors that search for high ET hadronic energy depositions. At the LVL2, the jet signatures are verified with the execution of a dedicated, fast jet reconstruction algorithm. Given the fact that the main jet's background are jets,the energy calibration at the LVL2 is one of the major dificulties of this trigger, allowing to distinguish low/high energy jets. The algorithm for the calibration has been chosen to be fast and robust, with a good performance. The other major dificulty is the execution time of the algorithm,dominated by the data unpacking time due to the large sizes of the jet ROI. In order to reduce the execution time, three possible granularities have been proposed and are being evaluated: cell based (standard), energy sums calculated at each Fron-End Board (FEB) and the use of the LVL1 Trigger Towers. The FEB and Trigger Tower granularities are also being used/evaluated for the reconstruction of the missing ET triggers at the Event Filter, given the short times available to process the full event. In this presentation, the design and implementation of the jet trigger of ATLAS will be discussed in detail, emphasasing the major dificulties of each selection step. The performance of the jet algorithm, including timing, eficiencies and rates will also be shown, with detailed comparisons of the different unpacking modes

Characterization of Reachable Attractors Using Petri Net Unfoldings

International audienceAttractors of network dynamics represent the long-term behaviours of the modelled system. Their characterization is therefore crucial for understanding the response and differentiation capabilities of a dynamical system. In the scope of qualitative models of interaction networks, the computation of attractors reachable from a given state of the network faces combinatorial issues due to the state space explosion. In this paper, we present a new algorithm that exploits the concurrency between transitions of parallel acting components in order to reduce the search space. The algorithm relies on Petri net unfoldings that can be used to compute a compact representation of the dynamics. We illustrate the applicability of the algorithm with Petri net models of cell signalling and regulation networks, Boolean and multi-valued. The proposed approach aims at being complementary to existing methods for deriving the attractors of Boolean models, while being %so far more generic since it applies to any safe Petri net

Asynchronous simulation of Boolean networks by monotone Boolean networks

International audienceWe prove that the fully asynchronous dynamics of a Boolean network f : {0, 1}^n → {0, 1}^n without negative loop can be simulated, in a very specific way, by a monotone Boolean network with 2n components. We then use this result to prove that, for every even n, there exists a monotone Boolean network f : {0, 1}^n → {0, 1}^n , an initial configuration x and a fixed point y of f such that: (i) y can be reached from x with a fully asynchronous updating strategy, and (ii) all such strategies contains at least 2^{n/2} updates. This contrasts with the following known property: if f : {0, 1}^n → {0, 1}^n is monotone, then, for every initial configuration x, there exists a fixed point y such that y can be reached from x with a fully asynchronous strategy that contains at most n updates